Proof and refutation in MALL as a game
نویسندگان
چکیده
منابع مشابه
Proof and refutation in MALL as a game
We present a setting in which the search for a proof of B or a refutation of B (i.e., a proof of ¬B) can be carried out simultaneously: in contrast, the usual approach in automated deduction views proving B or proving ¬B as two, possibly unrelated, activities. Our approach to proof and refutation is described as a two-player game in which each player follows the same rules. A winning strategy t...
متن کاملProof and Refutation in Formal Software Development
In this paper we describe investigations into the use of automatic theorem proving technology in the refutation of proof obligations. Specifically, we discuss the use of resolution based theorem proving and model checking to find false obligations and counterexamples. These techniques can be used as basis of an automatic method for finding faults in design during the formal development of softw...
متن کاملBipolar Proof Nets for MALL
In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious refinement of Classical Logic. Moreover, we set a correspondence between this paradigm and those more pragmatic ones inspired to transactional or distributed...
متن کاملThe Maryland Refutation Proof Procedure System (mrpps)
The Maryland Refutation Proof Procedure Systems (MRPPS) is an interactil perimental system intended for studying deductive search methods. Although the work is oriented towards question answering, MRPPS provides a general problem solving capability. There are three major components within MRPPS. These are: (1) an inference system, (2) a search strategy, and S (3) a base clause selection strateg...
متن کاملRefutation of Aslam's Proof that NP = P
Aslam presents an algorithm he claims will count the number of perfect matchings in any incomplete bipartite graph with an algorithm in the function-computing version of NC, which is itself a subset of FP. Counting perfect matchings is known to be #P-complete; therefore if Aslam's algorithm is correct, then NP=P. However, we show that Aslam's algorithm does not correctly count the number of per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2010
ISSN: 0168-0072
DOI: 10.1016/j.apal.2009.07.017